1559C - Mocha and Hiking - CodeForces Solution

from collections import defaultdict
from bisect import bisect_left
for _ in range(int(input())):

    n=int(input())

    l=list(map(int,input().split()))


    
    if l[-1]==1:
        ans=[]
        f=0
        for i in range(n):
            if l[i]==1 and f==0:
                ans.append(n+1)
                ans.append(i+1)
                f=1
            else:
                ans.append(i+1)

        if f==0:
            ans.append(n+1)
            ans.append(n)

        print(*ans)


    else:
        for i in range(1,n+2):
            print(i,end=" ")